Properties of approximate Parks-McClellan filters
نویسندگان
چکیده
It has been observed empirically that each coe cient in a Parks-McClellan lter converges to a steady state value as the lter length increases. This suggests the possibility of obtaining lters that are near optimal while "re-using" lter coe cients from shorter lters in the design of longer lters. In the context of approximate processing this then allows a ltering operation to be done in stages. This paper demonstrates this observation and examines some of its implications.
منابع مشابه
Two Novel Implementations of the Remez Multiple Exchange Algorithm for Optimum FIR Filter Design
One of the main advantages of the linear-phase FIR filters over their IIR counterparts is the fact that there exist efficient algorithms for optimizing the arbitrary-magnitude FIR filters in the minimax sense. In case of IIR filters, the design of arbitrary-magnitude filters is usually time-consuming and the convergence to the optimum solution is not always guaranteed. The most efficient method...
متن کاملRobust Vibration Suppression in Flexible Payloads Carried by Robot Manipulators Using Digital Filtering of Joint Trajectories
In this paper, a method for suppressing residual vibrations in flexible payloads, carried by robot manipulators, is proposed and experimentally demonstrated. The proposed method is based on the preconditioning of the robot joint trajectories using FIR digital filters. Several classes of FIR filters such as: a) Parks-McClellan, b) Window-based methods (using Hamming, Hanning, Boxcar, Kaiser, Bar...
متن کاملGeneral McClellan Transformation for Designing 2-D Complex FIR Digital Filters by Genetic Algorithm Approach
A powerful genetic algorithm (GA) approach is proposed to determine the optimal coefficients of McClellan transformation. It can be used to design any arbitrary shape transformation contours to map from one-dimensional (1-D) prototypes to two-dimensional (2-D) finite-duration impulse response (FIR) filters very effectively. Certain conditions are composed such that the scaling of the transforma...
متن کامل3-D migration via McClellan transformations on hexagonal grids
Two-dimensional (2-D) spatially varying convolutional filters for three-dimensional (3-D) depth extrapolation are efficiently designed and implemented by using McClellan transformations. Although efficient, McClellan transformations only approximate circularly symmetric depth extrapolation filters. The accuracy of the extrapolation filters can be increased only at an increase in the computation...
متن کاملPerformance of Complex Chebyshev Approximation in Delay-root-nyquist Filter Design
Root-Nyquist filters are crucial components in data communications and recently the ability to attach fractional sample delay attributes to them has become very important. Here we explore the application of Chebyshev approximation to design of such filters. Special attention is paid to the use of the Karam-McClellan algorithm, a fully complex extension of the well-established ParksMcClellan alg...
متن کامل